A Histogram-based Overcomplete Ica Algorithm

نویسندگان

  • Fabian J. Theis
  • Carlos G. Puntonet
  • Elmar W. Lang
چکیده

Overcomplete blind source separation (BSS) tries to recover more sources from less sensor signals. We present a new approach based on an estimated histogram of the sensor data; we search for the points fulfilling the overcomplete Geometric Convergence Condition, which has been shown to be a limit condition of overcomplete geometric BSS [1]. The paper concludes with an example and a comparison of various overcomplete BSS algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Null-space Algorithm for Overcomplete Independent Component Analysis

Independent component analysis (ICA) is an important method for blind source separation and unsupervised learning. Recently, the method has been extended to overcomplete situation where the number of sources is greater than the number of receivers. Comparing complete ICA and overcomplete ICA in existing literature, one can notice that complete ICA does not assume noise in observations, and the ...

متن کامل

Two Methods for Estimating Overcomplete Independent Component Bases

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data, e.g. image data. Most algorithms are based on approximations of the likelihood, which leads to computationally heavy procedures. Here we introduce two algorithms that are based on heuristic approximations and estimate an approximate overcomplete basis quite fast. The algorithms ar...

متن کامل

Two Approaches to Estimation of Overcomplete Independent Component Bases

Estimating overcomplete ICA bases is a difficult problem that emerges when using ICA on many kinds of natural data. Here we introduce two algorithms that estimate an approximate overcomplete basis quite fast in a high-dimensional space. The first algorithm is based on an assumption that the basis vectors are randomly distributed in the space, and the second on the gaussianization procedure.

متن کامل

A fast algorithm for estimating overcomplete ICA bases for image windows

We introduce a very fast method for estimating over-complete bases of independent components from image data. This is based on the concept of quasi-orthogonality, which means that in a very high-dimensional space, there can be a large, overcomplete set of vectors that are almost orthogonal to each other. Thus we may estimate an overcomplete basis by using one-unit ICA algorithms and forcing onl...

متن کامل

Algebraic Overcomplete Independent Component Analysis

Algebraic Independent Component Analysis (AICA) is a new ICA algorithm that exploits algebraic operations and vectordistance measures to estimate the unknown mixing matrix in a scaled algebraic domain. AICA possesses stability and convergence properties similar to earlier proposed geometic ICA (geo-ICA) algorithms, however, the choice of the proposed algebraic measures in AICA has several advan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003